Real-Time Queueing Theory - Real-Time Systems Symposium, 1996., 17th IEEE
نویسندگان
چکیده
This paper presents a new approach to real-time system scheduling. The approach, called real-time queueing theory, includes customer timing requirements into queueing models. With real-time queueing models, one is able to explicitly characterize the dynamic behavior of the customer lead-tame profile process where lead-time = deadline minus current time. In spite of the injinite dimensionality of these processes, in the heavy trafic case, a simple description of lead-time profile process is presented, and this description is shown to be very accurate when compared against simulations. Real-tame queueing theory offers the promise of providing real-time system predictability for systems characterized b y substantial stochastic behavior (such as ATM networks and multimedia systems). Possible generalizations are discussed.l
منابع مشابه
Commit Processing in Distributed Real-Time Database Systems - Real-Time Systems Symposium, 1996., 17th IEEE
W e investigate here the performance implications of supporting transaction atomicity in a distributed realtime database system. Using a detailed simulation model of a firm-deadline distributed real-time database sgstem, we profile the real-time performance of a representative set of commit protocols. A new commit protocol that i s designed for the real-time domain and allows transactions to “o...
متن کامل17th IEEE Real-Time Systems Symposium: Work in Progress Sessions
A real time implementation for allocating slack to aperiodic processes in MetaH is nearing comple tion The slack scheduling algorithm used is based on the slack stealer originally proposed in with practi cal extensions to allow for support of process criticali ties multiple process streams of di erent criticalities competing for pooled slack and inclusion of run time overheads in the slack func...
متن کامل17th IEEE Real-Time Systems Symposium: Work in Progress Sessions
Abstract We will describe our ongoing work in theWe will describe our ongoing work in the eld of optimal scheduling for real time systems We are primarily concerned with optimal task allocation and job scheduling for parallel computer systems Many real time task allocation and job scheduling problems are proven to be NP hard Recently we proposed a random ized optimization framework for e cientl...
متن کامل